An Algorithm Based on Loop-Cutting Contribution Function for Loop Cutset Problem in Bayesian Network
نویسندگان
چکیده
The loop cutset solving algorithm in the Bayesian network is particularly important for inference. This paper proposes an approximate minimum based on loop-cutting contribution index. Compared with existing algorithms, uses index of nodes and node-pairs to analyze from a global perspective, select candidates node-pair as unit. parameter μ control range node-pairs, ω selection conditions so that can adjust parameters according size networks, which ensures computational efficiency. numerical experiments show calculation efficiency significantly improved when it consistent accuracy algorithm; also studied influence settings using trend analysis two-way variance. unit solve cutset, helps improve inference structure analysis.
منابع مشابه
Randomized Algorithms for the Loop Cutset Problem
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference. Our randomized algorithm for nding a loop cutset outputs a minimum loop cutset after O(c 6kn) steps with probability at least 1 (1 1 6k ) k , where c > 1 is a constant speci ed by the user, k is the minimal size of a ...
متن کاملApproximation Algorithms for the Loop Cutset Problem
We show how to find a small loop cutset in a Bayesian network. Finding such a loop cutset is the first step in the method of conditioi~ing for inference. Our algorithm for finding a loop cutset, called MGA, finds a loop cutset which is guaranteed in the worst case to contain less than twice the number of variables contained in a minimum loop cutset. We test MGA on randomly generated graphs and ...
متن کاملRandom Algorithms for the Loop Cutset Problem
We show how to find a minimum loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in Pearl's method of conditioning for inference. Our random algorithm for finding a loop cutset, called REPEATEDWGUESSI, outputs a minimum loop cutset, after O(c.6"n) steps, with probability a t least 1 (1 $ ) c ~ * , where c > 1 is a constant specified by the user...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9050462